Can message buffers be axiomatized in linear temporal logic?
نویسندگان
چکیده
منابع مشابه
Can Message Buffers Be Axiomatized in Linear Temporal Logic?
Message passing is one of the primary modes of interprocess communication in a distributed system. In this paper we investigate the possibility of characterizing and axiomatizing different message passing systems in temporal logic. Specifically, we consider FIFO buffers (queues), LIFO buffers (stacks) and unordered buffers (bags). We show that all bounded buffers are characterizable in proposit...
متن کاملRegular Linear Temporal Logic
We present regular linear temporal logic (RLTL), a logic that generalizes linear temporal logic with the ability to use regular expressions arbitrarily as sub-expressions. Every LTL operator can be defined as a context in regular linear temporal logic. This implies that there is a (linear) translation from LTL to RLTL. Unlike LTL, regular linear temporal logic can define all ω-regular languages...
متن کاملRobust Linear Temporal Logic
Although it is widely accepted that every system should be robust, in the sense that “small” violations of environment assumptions should lead to “small” violations of system guarantees, it is less clear how to make this intuitive notion of robustness mathematically precise. In this paper, we address the problem of how to specify robustness in temporal logic. Our solution consists of a robust v...
متن کاملLinear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملLinear Temporal Logic and Linear Dynamic Logic on Finite Traces
In this paper we look into the assumption of interpreting LTL over finite traces. In particular we show that LTLf , i.e., LTL under this assumption, is less expressive than what might appear at first sight, and that at essentially no computational cost one can make a significant increase in expressiveness while maintaining the same intuitiveness of LTLf interpreted over finite traces. Indeed, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1984
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(84)80043-1